On the Mean Number of Facets of a Gaussian Polytope
نویسنده
چکیده
A Gaussian polytope is the convex hull of normally distributed random points in a Euclidean space. We give an improved error bound for the expected number of facets of a Gaussian polytope when the dimension of the space is fixed and the number of points tends to infinity. The proof applies the theory of the asymptotic distribution of the top order statistic of a collection of independently distributed N(0, 1) random variables.
منابع مشابه
A remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملSome Facets of the Polytope of Even Permutation Matrices
We describe a class of facets of the polytope of convex combinations of the collection of even n × n permutation matrices. As a consequence, we prove the conjecture of Brualdi and Liu [4] that the number of facets of the polytope is not bounded by a polynomial in n.
متن کاملDeriving Tight Bell Inequalities for 2 Parties with Many 2-valued Observables from Facets of Cut Polytopes
Relatively few families of Bell inequalities have previously been identified. Some examples are the trivial, CHSH, Imm22, and CGLMP inequalities. This paper presents a large number of new families of tight Bell inequalities for the case of many observables. For example, 44,368,793 inequivalent tight Bell inequalities other than CHSH are obtained for the case of 2 parties each with 10 2-valued o...
متن کاملGeometric shellings of 3-polytopes
A total order of the facets of a polytope is a geometric shelling if there exists a combinatorially equivalent polytope in which the corresponding order of facets becomes a line shelling. The subject of this paper is (geometric) shellings of 3-polytopes. Recently, a graph theoretical characterization of geometric shellings of 3-polytopes were given by Holt & Klee and Mihalisin & Klee. We rst gi...
متن کامل. M G ] 1 1 Ju n 20 04 Hyperbolic Coxeter n - polytopes with n + 3 facets
A polytope is called a Coxeter polytope if its dihedral angles are integer parts of π. In this paper we prove that if a noncompact Coxeter polytope of finite volume in IH has exactly n+3 facets then n ≤ 16. We also find an example in IH and show that it is unique. 1. Consider a convex polytope P in n-dimensional hyperbolic space IH. A polytope is called a Coxeter polytope if its dihedral angles...
متن کامل